Linear-time algorithms for weakly-monotone polygons
نویسندگان
چکیده
منابع مشابه
Separation of two monotone polygons in linear time
Let P = {p1, p2,..., pn} and Q = {q1, q2,..., qm} be two simple polygons monotonic in directions θ and φ, respectively. It is shown that P and Q are separable with a single translation in at least one of the directions: θ + π / 2, φ + π / 2. Furthermore, a direction for carrying out such a translation can be determined in O(m + n) time. This procedure is of use in solving the FIND-PATH problem ...
متن کاملOptimal Algorithms for Stabbing Polygons by Monotone Chains
In this paper we present optimal algorithms to compute monotone stabbers for convex polygons. More precisely, given a set of m convex polygons with n vertices in total we want to stab the polygons with an x-monotone polygonal chain such that each polygon is entered at its leftmost point and departed at its rightmost point. Since such a stabber does not exist in general, we study two related pro...
متن کاملRotationally Monotone Polygons
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into exactly two polygonal chains, such that one chain can be rotated clockwise around r and the other chain can be rotated counterclockwise around r with neither chain intersecting the interior of the polygon. We present the...
متن کاملConvexifying Monotone Polygons
This paper considers reconngurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can reconngure any monotone polygon into a convex polygon; a polygon is monotone if any vertical line intersects the interior at a (possibly empty) interval. Our algorithm computes in O(n 2) time a sequence of O(n 2) moves, each of which rotat...
متن کاملDetecting Weakly Simple Polygons
5 A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) 6 of a sequence of simple closed curves. We describe an algorithm to determine whether 7 a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time, 8 improving an earlier O(n3)-time algorithm of Cortese et al. [Discrete Math. 2009]. As 9 an immediate corollary, we obtain the fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1993
ISSN: 0925-7721
DOI: 10.1016/0925-7721(93)90031-z